منابع مشابه
A Goal-Oriented Approach to Computing the Well-Founded Semantics
D Global SLS resolution is an ideal procedural semantics for the well-founded semantics. We present a more effective variant of global SLS resolution, called XOLDTNF resolution, which incorporates simple mechanisms for loop detection and handling. Termination is guaranteed for all programs with the bounded-term-size property. We establish the soundness and (search space) completeness of XOLDTNF...
متن کاملComputing the Well-Founded Semantics Faster
We address methods of speeding up the calculation of the well-founded semantics for normal propositional logic programs. We first consider two algorithms already reported in the literature and show that these, plus a variation upon them, have much improved worst-case behavior for special cases of input. Then we propose a general algorithm to speed up the calculation for logic programs with at m...
متن کاملOn the Problem of Computing the Well-Founded Semantics
The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of finite propositional programs, it can be computed in polynomial time, more specifically, in O(|At(P)|×size(P)) steps, where size(P) denotes the total number of occurrences of atoms in a logic program P. This bound is achieved by an algorithm introduced by Van Gelder an...
متن کاملXsb: a System for Eeciently Computing Well-founded Semantics
The well-founded model provides a natural and robust semantics for logic programs with negative literals in rule bodies. We implemented the well-founded semantics in the SLG-WAM of XSB 19]. Performance results indicate that the overhead of delay and simpliica-tion to Prolog | or tabled | evaluations is minimal. To compute the well-founded semantics, the SLG-WAM adds to an eecient tabling engine...
متن کاملOn the problem of computing the well - founded semantics 1
The well-founded semantics is one of the most widely studied and used semantics of logic programs with negation. In the case of nite propositional programs, it can be computed in polynomial time, more speciically, in O(jAt(P)jsize(P)) steps, where size(P) denotes the total number of occurrences of atoms in a logic program P. This bound is achieved by an algorithm introduced by Van Gelder and kn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1993
ISSN: 0743-1066
DOI: 10.1016/0743-1066(93)90034-e